#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1e9 + 7;

int gcd(int a, int b)
{
    return b ? gcd(b, a % b) : a;
}

ll qmi(ll a, ll b)
{
    ll res = 1;
    while(b)
    {
        if(b & 1)res = res * a % mod;
        b >>= 1;
        a = a * a % mod;
    }
    return res;
}
struct custom_hash {
	static uint64_t splitmix64(uint64_t x) {
		x ^= x << 13;
		x ^= x >> 7;
		x ^= x << 17;
		return x; 
	}
	size_t operator () (uint64_t x) const {
		static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count(); // 时间戳
		return splitmix64(x + FIXED_RANDOM);
	}
};

void solve()
{
    int n, d, k;
    cin >> n >> d >> k;
    vector<int> L(n + 2), R(n + 2);
    for(int i = 1; i <= k; i++)
    {
        int l, r;
        cin >> l >> r;
        L[l]++;
        R[r]++;
    }
    for(int i = 1; i <= n; i++) R[i] += R[i - 1];
    for(int i = n; i >= 0; i--) L[i] += L[i + 1];

    int mx = INT_MIN, mi = INT_MAX;
    int la = 0, ra = 0;

    for(int i = 1; i + d - 1 <= n; i++)
    {
        int t = R[i - 1] + L[i + d];
        if(t > mx) {
            mx = t;
            la = i;
        }
        if(t < mi) {
            mi = t;
            ra = i;
        }
    }
    cout << ra << ' ' << la << endl;
}

int main()
{
    int t;
    cin >> t;
    while(t--) solve();
    return 0;
}